Depth-Bounded Communication Complexity for Distributed Computation
ثبت نشده
چکیده
"!# $% !# &' )( * +& , -.-/ &0 21 , 3& , -3! 4) '5 ) 6 78 9 ;:< 3 ;:<,=! *> & 4)4) . % !? @$ @ ' A& , -.! B @1 , ? @4<&', -.!#, ' > 0C DE* F, ! -. G0 2 , H, 7 I; &' )( J K ,L-. 1 -. G + @-3, > 3, M MN, $%-3 2 , O 95 &B*? +78 9 ;:< O * % + 6: , !? @$ 0C P @$% Q *? 2 R * ,@ , A, MS& , -.-/ &0 2 , 3 ! * * , 4 T7# F&0 @! $% T ,U$% 'V? &' * J % -W!# $%MN, $%-A @ & C 6 !? @$ & 4X @$ Y:< K:E 4 4 MZ,>& P, U ! * 1%[ & , -3-/ )&0 2 , S 8:E* &9* *? @ \ * ]-., % \! $ @&' & 4> @! ! 4 &0 2 , ^ _ ` Y ) SC^ ] * ,a: *? 2 , -. '5 % K '&9* b> E& J7# _ @! ! 4 J A * P& , > '5> , M] ! * 1%[.& , -.-/ &0 2 , UMN, $P& , -/7 ? 2 , ? @4 ! $%, 7 4 -. 0C=D , '5 ' c ,3 % b ' > X @4^&0 @ ' 0 : _ * ,a:d *? 2 Q ? @-. &_& , MZ &9 , $ 1 Q * , 4 K78 R ' = ,Q B @e R @ (@ @ > B @ R, M B 2 ] MN, $%-3 2 , =MN, $ & , -3-/ )&0 2 , -3 ) -3 )G0 2 , SCfDE* , $% ' & 4_ @ ? @4) % F * ,a:E *? 2 Q * = '5 @&' g ! * 1%[K , 4 ), c E % B 2 % )&0 @4 4) A( $ F& 4 , % _ , * 4 ,a:< $<7#, cMN, $E @ > >1h ! *F&', -.-/ &0 2 , A& , -.! 4 '5 i ; C
منابع مشابه
On Distributed Model Checking of MSO on Graphs
We consider distributed model-checking of Monadic SecondOrder logic (MSO) on graphs which constitute the topology of communication networks. The graph is thus both the structure being checked and the system on which the distributed computation is performed. We prove that MSO can be distributively model-checked with only a constant number of messages sent over each link for planar networks with ...
متن کاملA Tight Lower Bound on Distributed Random Walk Computation
We consider the problem of performing a random walk in a distributed network. Given bandwidth constraints, the goal of the problem is to minimize the number of rounds required to obtain a random walk sample. Das Sarma et al. [PODC’10] show that a random walk of length l on a network of diameter D can be performed in Õ( √ lD + D) time. A major question left open is whether there exists a faster ...
متن کاملA* Search for Soft Constraints Bounded by Tree Decompositions
Some of the most efficient methods for solving soft constraints are based on heuristic search using an evaluation function that is mechanically generated from the problem. However, if only a few best solutions are needed, significant effort can be wasted pre-computing heuristics that are not used during search. Recently, a scheme for depth-first branch-and-bound search has been proposed that av...
متن کاملLower Bounds for One-way Probabilistic Communication Complexity
We prove three diierent types of complexity lower bounds for the one-way unbounded-error and bounded-error error probabilistic communication protocols for boolean functions. The lower bounds are proved in terms of the deterministic communication complexity of functions and in terms of the notion \probabilistic communication characteristic" that we deene. We present boolean functions with the di...
متن کاملAdaptive Distributed Consensus Control for a Class of Heterogeneous and Uncertain Nonlinear Multi-Agent Systems
This paper has been devoted to the design of a distributed consensus control for a class of uncertain nonlinear multi-agent systems in the strict-feedback form. The communication between the agents has been described by a directed graph. Radial-basis function neural networks have been used for the approximation of the uncertain and heterogeneous dynamics of the followers as well as the effect o...
متن کامل